2 0 1 0 ) 0 1 5 Application of Many - core Accelerators for Problems
نویسنده
چکیده
Recently, many-core accelerators are developing so fast that the computing devices attract researchers who are always demanding faster computers. Since many-core accelerators such as graphic processing unit (GPU) are nothing but parallel computers, we need to modify an existing application program with specific optimizations (mostly parallelization) for a given accelerator. In this paper, we describe our problem-specific compiler system for many-core accelerators, specifically, GPU and GRAPE-DR. GRAPE-DR is another many-core accelerators device that is specially targeted scientific applications. In our compiler, we focus a compute intensive problem expressed as two-nested loop. Our compiler asks a user to write computations in the inner-most loop. All details related to parallelization and optimization techniques for a given accelerator are hidden from the user point of view. Our compiler successfully generates the fastest code ever for astronomical N-body simulations with the performance of 2.6 TFLOPS (single precision) on a recent GPU. Another successful application on both GPU and GRAPE-DR is the evaluation of a multi-dimensional integral in quadruple precision. The program generated by our compiler runs at a speed of 15 QD-GFLOPS on GPU and 4 QD-GFLOPS on GRAPE-DR. The performance obtained so far is more than 50-200 times faster than a conventional CPU.
منابع مشابه
An Electro-Optic Deflector for a Fast Laser-Wire Scanner
A large aperture electro-optic deflector has been designed, realized and tested for application on a laser-wire-scanner for particle accelerators. Results on the important parameters such as deflection strength, speed and mode quality preservation are shown and discussed. This report was presented in the EPAC Conference under the reference TUPC123 [email protected] !"#$%$&'()*)+',&#-$.%$...
متن کاملJohn Resig: Building JQuery
C O M P U T E R 0 0 1 8 9 1 6 2 / 1 5 / $ 3 1 . 0 0 © 2 0 1 5 I E E E P U B L I S H E D B Y T H E I E E E C O M P U T E R S O C I E T Y M AY 2 0 1 5 7 Over the past 15 years, JavaScript has evolved from a “toy” language to a mainstream programming one that powers Web browsers, games, and server applications. Perhaps the most significant development that led to JavaScript’s ubiquitous use was th...
متن کاملSafety-critical Java for embedded systems
StringBuilder 447 / 237 2 / 6 52 (50) / 29 (26) 2 / 2 StringBuilder 189 / 119 1 / 1 38 (35) / 19 (18) 4 / 4 DataInputStream 212 / 108 4 / 5 18 (18) / 17 (17) 1 / 1 DataInputStream$ReadUtfHelper – / 77 – / 2 – / 1 – / 1 DataInputStream$1 – / 6 – / 0 – / 1 – / 0 Vector 322 / 228 4 / 7 48 (45) / 36 (35) 4 / 2 Vector$1 14 / 14 1 / 1 2 / 2 0 / 0 Vector$Itr 33 / 33 3 / 3 4 / 4 0 / 0 Vector$ListItr 43...
متن کاملPositive Solutions for Resonant and Nonresonant Nonlinear Third-Order Multipoint Boundary Value Problems
and Applied Analysis 3 (C6) (P + JQN)γ(∂Ω 2 ) ⊂ C, (C7) Ψ γ (Ω 2 \ Ω 1 ) ⊂ C, then the equation Lx = Nx has a solution in the set C ∩ (Ω 2 \ Ω 1 ). 3. Positive Solution for the Nonresonant Problem In this section, we suppose that f ∈ C([0, 1] × [0, +∞), [0, +∞)) and ∑m−2 i=1 β i < 1. We begin with some preliminary results. Consider the problem x (t) + y (t) = 0, t ∈ [0, 1] , (10) x (0) =...
متن کاملPOSITIVE SOLUTIONS OF THREE-POINT BOUNDARY VALUE PROBLEMS FOR HIGHER-ORDER p-LAPLACIAN WITH INFINITELY MANY SINGULARITIES
where φp(s) is a p-Laplacian operator, that is, φp(s)= |s|p−2s, p > 1, η ∈ (0,1) is a given constant, α > 0, γ > 0, β ≥ 0, δ ≥ 0, g : [0,1]→ [0,∞) has countable many singularities on (0,1/2). In recent years, because of the wide mathematical and physical backgrounds [7, 8], the existence of positive solutions for nonlinear boundary value problems with p-Laplacian received wide attention. Especi...
متن کامل